Scattering Poles near the Real Axis for Two Strictly Convex Obstacles
نویسندگان
چکیده
منابع مشابه
Scattering Poles near the Real Axis for Two Strictly Convex Obstacles
To study the location of poles for the acoustic scattering matrix for two strictly convex obstacles with smooth boundaries, one uses an approximation of the quantized billiard operator M along the trapped ray between the two obstacles. Using this method Gérard (cf. [9]) obtained complete asymptotic expansions for the poles in a strip Im z ≤ c as Re z tends to infinity. He established the existe...
متن کاملDynamical Zeta Function for Several Strictly Convex Obstacles
The behavior of the dynamical zeta function ZD(s) related to several strictly convex disjoint obstacles is similar to that of the inverse Q(s) = 1 ζ(s) of the Riemann zeta function ζ(s). Let Π(s) be the series obtained from ZD(s) summing only over primitive periodic rays. In this paper we examine the analytic singularities of ZD(s) and Π(s) close to the line Rs = s2, where s2 is the abscissa of...
متن کاملOn the Schrodinger equation outside strictly convex obstacles
We prove sharp Strichartz estimates for the semi-classical Schrödinger equation on a compact Riemannian manifold with smooth, strictly geodesically concave boundary. We deduce classical Strichartz estimates for the Schrödinger equation outside a strictly convex obstacle, local existence for the H1-critical (quintic) Schrödinger equation and scattering for the sub-critical Schrödinger equation i...
متن کاملA High Frequency Bem for Scattering by Non-convex Obstacles
Traditional numerical methods for time-harmonic acoustic scattering problems become prohibitively expensive in the high-frequency regime where the scatterer is large compared to the wavelength of the incident wave. In this paper we propose and analyse a hybrid boundary element method (BEM) for a class of non-convex polygonal scatterers. In this method the approximation space is enriched with os...
متن کاملEuclidean TSP between two nested convex obstacles
We present a polynomial-time algorithm for a variant of the Euclidean traveling salesman tour where n vertices are on the boundary of a convex polygon P and m vertices form the boundary of a convex polygonal obstacle Q completely contained within P . In the worst case the algorithm needs O(m lg m+ mn) time and O(nm + m) space.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Henri Poincaré
سال: 2007
ISSN: 1424-0637,1424-0661
DOI: 10.1007/s00023-006-0315-3